منابع مشابه
Polynomial weights and code constructions
An explicit and easily implemented solution is given to thegeneral problem of linear mean-square estimation of a signal or systemprocess based upon noisy observations, under the assumption that theautoand cross-correlation functions of the signal and the observationprocesses are known. Also a number of specific estimation problems arebriefly discussed.
متن کاملCategorical Code Constructions
We study categories of codes and precodes. The objects in these categories capture the encoding and decoding process of error control codes, source codes, or cryptographic codes. We show that these categories are complete and cocomplete. This gives a wealth of new code constructions.
متن کاملOptimal Subsystem Code Constructions
In this paper, a generic method to derive subsystem codes from existing subsystem codes is given that allows one to trade the dimensions of subsystem and co-subsystem while maintaining or improving the minimum distance. As a consequence, it is shown that all pure MDS subsystem codes are derived from MDS stabilizer codes. Furthermore, a simple construction of pure MDS subsystem codes is obtained...
متن کاملLocally Repairable Regenerating Code Constructions
In this work, we give locally repairable regenerating code (LRRC) [1]–[4] constructions that can protect the file size promised by the graph analysis of the modified family helper selection (MFHS) scheme [1] at the minimum-bandwidthregenerating (MBR) point. I. RANDOM LINEAR CODE CONSTRUCTION FOR A CLASS OF (n, k, d, r) PARAMETERS In this section, we prove the existence and construction of linea...
متن کاملGenerators and weights of polynomial codes
Introduction. Several authors have established that many classical codes are ideals in certain ring constructions. Berman [3], in the case of characteristic two, and Charpin [5], in the general case, proved that all generalized Reed-Muller codes coincide with powers of the radical of the quotient ring A = Fq[x1, . . . , xn]/(x q1 1 − 1, . . . , xn n − 1), where Fq is a finite field, p = charFq ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 1973
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.1973.1054936